Decidability results for Watson–Crick D0L systems with nonregular triggers

Watson-Crick D0L systems with regular triggers

A new proof for the decidability of D0L ultimate periodicity

L systems were originally introduced by A. Lindenmayer to model the development of simple filamentous organisms [6, 7]. The challenging and fruitful study of these systems in the 70s and 80s created many new results and notions [9]. In this paper we consider the important problem of recognizing ultimately periodic D0L sequences. Let A be a finite alphabet and denote the empty word by ε . A D0L ...

Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) infinitely many control states along with an auxiliary store, but which have a well-quasi-ordering on the set of control states. The set of reachable configurations of the automaton may themselves not be well-quasi-ordered becau...

Watson-Crick D0L Systems

D0L systems constitute the simplest and most widely studied type of Lindenmayer systems. They have the remarkable property of generating their language as a (word) sequence and, consequently, are very suitable for modeling growth properties. In this paper a new type of D0L systems is introduced, where the parallelism presented in L systems is combined with the paradigm of (Watson-Crick) complem...

Universal computation with Watson-Crick D0L systems

Watson-Crick D0L systems, introduced in 1997 by V. Mihalache and A. Salomaa, arise from two major principles: the Lindenmayer rewriting and the Watson-Crick complementarity principle. Complementarity can be viewed as a purely language-theoretic operation. Majority of a certain type of symbols in a string (purines vs. pyrimidines) triggers a transition to the complementary string. The paper deal...